منابع مشابه
Matrix-free interior point method
In this paper we present a redesign of a linear algebra kernel of an interior point method to avoid the explicit use of problem matrices. The only access to the original problem data needed are the matrix-vector multiplications with the Hessian and Jacobian matrices. Such a redesign requires the use of suitably preconditioned iterative methods and imposes restrictions on the way the preconditio...
متن کاملGPU Acceleration of the Matrix-Free Interior Point Method
Interior point methods (IPM) with direct solution of the underlying linear systems of equations have been used successfully to solve very large scale linear programming (LP) problems. However, the limitations of direct methods for some classes of problems have led to iterative techniques being considered. The matrix-free method is one such approach and is so named since the iterative solution p...
متن کاملMatrix-free interior point method for compressed sensing problems
We consider a class of optimization problems for sparse signal reconstruction which arise in the field of Compressed Sensing (CS). A plethora of approaches and solvers exist for such problems, for example GPSR, FPC AS, SPGL1, NestA, `1 `s, PDCO to mention a few. CS applications lead to very well conditioned optimization problems and therefore can be solved easily by simple first-order methods. ...
متن کاملAn Infeasible{interior{point Method for the P -matrix Lcp
A predictor-corrector method for solving the P (k)-matrix linear complementarity problems from infeasible starting points is analyzed. Two matrix factorizations and at most three backsolves are to be computed at each iteration. The computational complexity depends on the quality of the starting points. If the starting points are large enough then the algorithm has O ? (+ 1) 2 nL iteration compl...
متن کاملInterior Point Method
All forms of the simplex method reach the optimum by traversing a series of basic solutions. Since each basic solution represents an extreme point of the feasible region, the track followed by the algorithm moves around the boundary of the feasible region. In the worst case, it may be necessary to examine most if not all of the extreme points. This can be cripplingly inefficient given that the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2010
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-010-9361-3